Quantifying Quillen’s uniform $\mathcal{F}_p$-isomorphism theorem
نویسندگان
چکیده
منابع مشابه
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \...
متن کاملAn isomorphism theorem for digraphs
A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...
متن کاملThe First-Order Isomorphism Theorem
For any class C und closed under NC reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC) reductions are isomorphic under first-order computable
متن کاملThe Norm Residue Isomorphism Theorem
We provide a patch to complete the proof of the Voevodsky-Rost Theorem, that the norm residue map is an isomorphism. (This settles the motivic Bloch-Kato conjecture).
متن کاملA Theorem on the Isomorphism Property
An L{structure is called internally presented in a nonstandard universe if its base set and interpretation of every symbol in L are internal. A nonstandard universe is said to satisfy the {isomorphism property if for any two internally presented L{structures A and B, where L has less than many symbols, A is elementarily equivalent to B implies that A is isomorphic to B. In this paper we prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Homology, Homotopy and Applications
سال: 2020
ISSN: 1532-0073,1532-0081
DOI: 10.4310/hha.2020.v22.n2.a4